Minimal achievable approximation ratio for MAX-MQ in finite fields
نویسندگان
چکیده
منابع مشابه
Minimal achievable approximation ratio for MAX-MQ in finite fields
Given a multivariate quadratic polynomial system in a finite field Fq, the problem MAX-MQ is to find a solution satisfying the maximal number of equations. We prove that the probability of a random assignment satisfying a non-degenerate quadratic equation is at least 1q −O(q− n 2 ), where n is the number of the variables in the equation. Consequently, the random assignment provides a polynomial...
متن کاملPCP Theorem And Hardness Of Approximation For MAX-SATISFY Over Finite Fields
This paper will survey the PCP theorem and its application in solving the MAX-SATISFY. For the problem MAX-SATISFY over F2, a random assignment satisfies half the equations and thus yields a 2-approximation algorithm. It is the best possible approximation algorithm in polynomial time based on P 6= NP , even if each equation only contains exactly three variables, which can be proved by the 3-bit...
متن کاملOn minimal rank over finite fields
Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F ) is the minimum rank of a symmetric n× n F -valued matrix whose off-diagonal zeroes are the same as in the adjacency matrix of G. If F is finite, then for every k, it is shown that the set of graphs of minimal rank at most k is characterized by finitely many forbidden induced subgraphs, each on at most ...
متن کاملMinimal Linear Codes over Finite Fields
As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that wmin/wmax > (q− 1)/q is a sufficient condition for a linear code over the finite field ...
متن کاملEla on Minimal Rank over Finite Fields∗
Let F be a field. Given a simple graph G on n vertices, its minimal rank (with respect to F ) is the minimum rank of a symmetric n× n F -valued matrix whose off-diagonal zeroes are the same as in the adjacency matrix of G. If F is finite, then for every k, it is shown that the set of graphs of minimal rank at most k is characterized by finitely many forbidden induced subgraphs, each on at most ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.02.003